Cellular Automata and Models of Computation

Preface This issue contains seven papers presented during the " Third Symposium on Cellular Automata– Journées Automates Cellulaires " (JAC 2012), held in La Marana, Corsica (France) in the period Septem-ber 19th–21th, 2012. The scope of the symposium is centered on Cellular Automata (CA), tilings and related models of computation. Topics of interest include (but are not limited to) algorithmic, computability, complexity, formal languages, symbolic dynamics, topological, ergodic, algebraic, and structure aspects of these models. After an additional review process, seven papers were selected and included in this special issue. They are now presented in an extended and improved form with respect to the already refereed workshop version that appeared in the proceedings of JAC 2012. have contributed the article titled " Sto-chastic Cellular Automata: Correlations, Decidability and Simulations " which deals with deterministic, non–deterministic, and stochastic cellular automata. The authors extend the notion of intrinsic simulation between deterministic cellular automata to the non–deterministic and stochastic settings, and consider the decidability issue of the related problems. In the paper " On Completeness and Decidability of Phase Space Invertible Asynchronous Cellular Automata " , Simon Wacker and Thomas Worsch introduce asynchronous cellular automata which are invertible in a certain sense. They show results about the computational completeness of some of these automata and the decidability problem concerning the invertibility for two classes of asynchronous cellular automata. in the paper " Periodic orbits and dynamical complexity in Cellular Automata " study the set of strictly temporally periodic configurations for surjective cellular automata. They investigate the relation between the size of this set and the dynamical complexity of a given automaton in both the general and additive CA setting. Cellular automata and iterative arrays are investigated as parallel models to compute transductions by Martin Kutrib and Andreas Malcher in " One-Dimensional Cellular Automaton Transducers ". In particular, the authors study the computational capabilities of these models and compare them with the sequential finite state transducers and pushdown transducers.